Finding regular insertion encodings for permutation classes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding regular insertion encodings for permutation classes

Permutation classes, or restricted permutations, have received considerable attention over the past two decades, and during this time a great variety of techniques have been used to enumerate them. One of the most popular approaches, pioneered by Chung, Graham, Hoggatt, and Kleiman [4], employs generating trees. The permutation classes with finitely labeled generating trees were characterized i...

متن کامل

Universal cycles for permutation classes

We define a universal cycle for a class of n-permutations as a cyclic word in which each element of the class occurs exactly once as an n-factor. We give a general result for cyclically closed classes, and then survey the situation when the class is defined as the avoidance class of a set of permutations of length 3, or of a set of permutations of mixed lengths 3 and 4. Résumé. Nous définissons...

متن کامل

Approximations to Permutation Classes

We investigate a new notion of approximately avoiding a permutation: π almost avoids β if one can remove a single entry from π to obtain a β-avoiding permutation.

متن کامل

Small Permutation Classes

We establish a phase transition for permutation classes (downsets of permutations under the permutation containment order): there is an algebraic number κ, approximately 2.20557, for which there are only countablymany permutation classes of growth rate (StanleyWilf limit) less than κ but uncountably many permutation classes of growth rate κ, answering a question of Klazar. We go on to completel...

متن کامل

Deflatability of permutation classes

A permutation class is said to be deflatable if its simple permutations are contained within a proper subclass. Deflatable classes are often easier to describe, analyze and enumerate than their non-deflatable counterparts. This paper presents theorems guaranteeing the non-deflatability of principal classes, constructs an infinite family of deflatable principal classes, and provides examples of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2012

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2011.11.002